Graded Delaunay Decoupling Method for Parallel Guaranteed Quality Planar Mesh Generation
نویسندگان
چکیده
We present a method for creating large 2D graded, guaranteed quality, Delaunay meshes on parallel machines. The method decouples the mesh generation procedure for each subdomain, and thus eliminates the communication between processors, while the final mesh is of guaranteed quality. This work extents our previous result on the uniform Delaunay Decoupling method [19], by allowing the element size to be governed by a sizing function, or a background mesh, and thus to produce large graded meshes. The graded Delaunay decoupling method demonstrates high efficiency, ten billion elements can be created in five minutes, with very small over-refinement (about 2%), and also results high speed-ups. This parallelization approach is effective, using off-the-self, well tested and fine tuned, sequential mesh generation libraries without modification.
منابع مشابه
Delaunay Decoupling Method for Parallel Guaranteed Quality Planar Mesh Refinement
Creating in parallel guaranteed quality large unstructured meshes is a challenging problem. Parallel mesh generation procedures decompose the original mesh generation problem into smaller subproblems that can be solved in parallel. The subproblems can be treated as either completely or partially coupled, or they can be treated as completely decoupled. In this paper we present a parallel guarant...
متن کاملDecoupling Method for Parallel Delaunay 2D Mesh Generation
PAGE Meshes are central structures for numerical methods, such as the finite element method. These numerical methods require high quality refined meshes in order to achieve good approximations of the analytical model. Unstructured meshes are the most popular; their adaptive nature allows them to give boundary conforming meshes of good quality, with optimal size. The most widely studied 2D mesh ...
متن کاملParallel 2D Graded Guaranteed Quality Delaunay Mesh Refinement
We develop a theoretical framework for constructing guaranteed quality Delaunay meshes in parallel for general two-dimensional geometries. This paper presents a new approach for constructing graded meshes, i.e., meshes with element size controlled by a user-defined criterion. The sequential Delaunay refinement algorithms are based on inserting points at the circumcenters of triangles of poor qu...
متن کاملParallel Guaranteed Quality Delaunay Uniform Mesh Refinement
We present a theoretical framework for developing parallel guaranteed quality Delaunay mesh generation software, that allows us to use commercial off-the-shelf sequential Delaunay meshers for two-dimensional geometries. In this paper, we describe our approach for constructing uniform meshes, in other words, the meshes in which all elements have approximately the same size. Our uniform distribut...
متن کاملA Template for Developing Next Generation Parallel Delaunay Refinement Methods
We describe a complete solution for both sequential and parallel construction of guaranteed quality Delaunay meshes for general two-dimensional geometries. We generalize the existing sequential point placement strategies for guaranteed quality mesh refinement: instead of a specific position for a new point, we derive two types of two-dimensional regions which we call selection disks. Both types...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- SIAM J. Scientific Computing
دوره 30 شماره
صفحات -
تاریخ انتشار 2008